Non-commutative proof construction: A constraint-based approach

Constraint Based Proof Construction in Non-Commutative Logic

This work presents a computational interpretation of the construction process for cyclic (CyLL) and noncommutative (NL) sequential proofs. We assume a proof construction paradigm, based on a normalization procedure, known as focussing which manages eÆciently the non-determinism of the construction. Similarly to the linear case, a new formulation of focussing for NL is used to introduce a genera...

A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS

In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.

Proof Nets Construction and Automated Deduction in Non-commutative Linear Logic -extended Abstract

Proof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (LL) and form a good formalism to analyze some computation mechanisms, for instance in type-theoretic interpretations. This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic that is useful for applications including planning, concurrency or...

Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic

Proof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (LL) and form a good formalism to analyze some computation mechanisms, for instance in type-theoretic interpretations. This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic that is useful for applications including planning, concurrency or...

Constraint Based Proof Constru tion in Non - Commutative Logi